PROBLEM OF SCHEDULING IN PERMUTATION FLOWSHOP IS DEALT WITH BY MINIMIZING THE MAKESPAN. IF THERE ARE MORE THAN THREE MACHINES, THEN IT IS NP-COMPELET PROBLEMS AND SHOULD BE SOLVED BY METAHEURISTIC ALGORITHM. THE OBJECTIVE OF THIS ARTICLE WAS TO MINIMIZE TOTAL FLOWTIME OF JOBS. TO THIS END, THE ALGORITHM OF ELECTROMAGNETISM-LIKE METHOD (EM) WAS APPLIED, WHICH UTILIZED AN ATTRACTION-REPULSION MECHANISM TO MOVE THE SAMPLE POINTS TOWARD OPTIMALITY. THE COMPUTATIONAL RESULTS DEMONSTRATED THAT EM WAS ROBUST IN PRACTICE. MOREOVER, THIS ALGORITHM HAD TWO OTHER ADVANTAGES: I: SIMPLICITY OF APPLICATION AND II: OCCUPYING MINOR MEMORY CAPACITY. IN THE FIRST STAGE, THE BASE ALGORITHM WAS DEVELOPED BY COMPENSATING FOR THE LACK OF CONVERGENCE. IN THE SECOND STAGE, THE PARALLEL ALGORITHM WAS APPLIED. FINALLY, RESULTS OF THE ALGORITHM WERE COMPARED WITH THOSE OF OTHER ALGORITHMS.